Aiming at the problems of Byzantine Fault Tolerant （BFT） consensus mechanisms in the blockchain such as high communication complexity， complex view change and poor scalability， a consensus algorithm based on binomial swap forest and HotStuff named HSP （HotStuff Plus） consensus algorithm was proposed. In order to realize signature batch verification and signature aggregation， the Boneh-Lynn-Shacham （BLS） signature algorithm was adopted； in order to reduce the communication complexity of the system， threshold signature technology was adopted； in order to reduce the communication complexity during view change， the consensus process adopted a three-phase confirmation method； in order to reduce the number of communications between the primary and secondary nodes and reduce the pressure on the primary node when aggregating signatures， an improved binomial swap forest technology was adopted. Test results show that when the total number of system nodes is 64 and the request and reply are both 256 bytes， the throughput of HSP consensus algorithm is 33.8% higher than that of HotStuff consensus mechanism， and the consensus delay of HSP consensus algorithm is 16.4% lower than that of HotStuff consensus mechanism. It can be seen that HSP consensus algorithm has better performance when the number of nodes is large.